- successive over-relaxation method
- Макаров: (SOR method) метод последовательной верхней релаксации
Универсальный англо-русский словарь. Академик.ру. 2011.
successive over-relaxation method
Смотреть что такое "successive over-relaxation method" в других словарях:
Successive over-relaxation — (SOR) is a numerical method used to speed up convergence of the Gauss–Seidel method for solving a linear system of equations. A similar method can be used for any slowly converging iterative process. It was devised simultaneously by David M.… … Wikipedia
Relaxation method — In numerical mathematics, the relaxation method is a method for obtaining numerical approximations to the solutions of systems of equations, including certain types of elliptic partial differential equations, in particular Laplace s equation and… … Wikipedia
Relaxation (approximation) — In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby problem that is easier to solve. A solution of the relaxed problem provides information about… … Wikipedia
Iterative method — In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. A specific implementation of an iterative method, including the termination… … Wikipedia
Méthode de surrelaxation successive — En analyse numérique, la méthode de surrelaxation successive est une variante de la méthode de Gauss Seidel pour résoudre un système d équations linéaires. La convergence de cet algorithme est généralement plus rapide. Une approche similaire peut … Wikipédia en Français
Gauss–Seidel method — The Gauss–Seidel method is a technique used to solve a linear system of equations. The method is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel. The method is an improved version of the Jacobi method. It… … Wikipedia
Preconditioned conjugate gradient method — The conjugate gradient method is a numerical algorithm that solves a system of linear equations:A x= b.,where A is symmetric [positive definite] . If the matrix A is ill conditioned, i.e. it has a large condition number kappa(A), it is often… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
David M. Young, Jr. — David M. Young, Jr. Born October 20, 1923(1923 10 20) Quincy, Massachusetts … Wikipedia
Preconditioner — In linear algebra and numerical analysis, a preconditioner P of a matrix A is a matrix such that P −1 A has a smaller condition number than A .Preconditioners are useful when using an iterative method to solve a large, sparse linear system : Ax … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
